package question15;

public class leetcode718 {

    public int findLenth(int[] nums1, int[] nums2) {
        int[][] dp = new int[nums1.length+1][nums2.length+1];
        int ans = dp[0][0];
        for (int i = 1; i <= nums1.length; i++) {
            for (int j = 1; j <= nums2.length; j++) {
                if (nums1[i-1] == nums2[j-1]) {
                    dp[i][j] = dp[i-1][j-1] + 1;
                }
                ans = Math.max(ans, dp[i][j]);
            }
        }

        return ans;
    }

    public static void main(String[] args) {
        int num = new leetcode718().findLenth(new int[]{0,1,1,1,1}, new int[]{1,0,1,0,1});
        System.out.println(num);
    }
}
